Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((ZHNAG Peng[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Review of QoS mechanisms for mobile Ad Hoc networks
ZHNAG Peng CUI Yong SUN Lei
Journal of Computer Applications
Abstract
(
1748
)
PDF
(1980KB)(
1516
)
Knowledge map
Save
There are difficulties to guarantee QoS of mobile Ad Hoc networks due to their features of dynamically changing topology and wireless communication. Current QoS techniques for mobile Ad Hoc networks are divided into five categories: link layer solutions, network layer solutions, transport layer solutions, cross layers solutions and cross networks solutions. The main link layer solutions are QoS MAC protocols. The main idea in network layer solutions is QoS routing. Wireless TCP is the main scheme to guarantee QoS in transport layer. To choose route and balance load, cross layer solutions were researched to provide network architectures to support QoS. The main idea in cross network solutions is to propose QoS solutions between mobile Ad Hoc networks and fixed networks. These QoS solutions were introduced and analyzed.
Related Articles
|
Metrics
Select
New XML document coding scheme based on complete binary tree
ZHNAG Peng FENG Jian-Hua FANG Zhi-Feng
Journal of Computer Applications
Abstract
(
1769
)
PDF
(776KB)(
929
)
Knowledge map
Save
In this paper, a new coding scheme was proposed, which was based on the sequence of its complete binary tree. The scheme is easy to realize and only one positive integer is needed to express the position of the node in XML tree. The time-bounding of identifying the ancestor-descendant relationships is only O(log n). It also supports XML document update. In the scheme, the length of the code is short.
Related Articles
|
Metrics
Select
A new structural join algorithm in Native XML database
ZHNAG Peng Jian-Hua FENG Zhi-Feng FANG
Journal of Computer Applications
Abstract
(
1693
)
PDF
(782KB)(
891
)
Knowledge map
Save
Structural join operation is the main solution to Native XML database query. Based on the survey of existing structural join algorithms, a new structural join algorithm, depth partition based structural join algorithm (DRIAM) was proposed. In DRIAM, input data sets AList and DList were not necessary to be ordered or indexed so that the additional cost was avoided. AList and DList were not necessary to be loaded in the memory. Besides, the timecomplexity of DRIAM was very low.
Related Articles
|
Metrics